Service Time of Self-Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings - Extended Abstract -
نویسنده
چکیده
Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every processor obtains the token once).
منابع مشابه
Service Time of Self - Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings - Extended
Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every proce...
متن کاملOptimization of Service Time and Memory Space in a Self Stabilizing Token Circulation Protocol on Anonymous Unidirectional Rings
We present a self stabilizing token circulation protocol on unidirectional anonymous rings This protocol does not required processor identi ers no distinguished processor i e all processors perform the same algorithm The algorithm can deal with any kind of schedulings even unfair ones Our protocol is a randomized self stabilizing meaning that starting from an arbitrary con guration in response ...
متن کاملService Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), i...
متن کاملSelf-Stabilizing Token Circulation on Anonymous Message Passing Rings
A self-stabilizing algorithm that solves the problems of token circulation and leader election on anonymous and uniform, unidirectional, message passing rings of arbitrary, but known, size is developed. From any initial configuration, the expected time to stabilization on a ring of size n is in O(n log n). Furthermore, the size of the configuration of the system remains constant throughout the ...
متن کاملSelfStabilizing Token Circulation on Anonymous Message Passing
A self-stabilizing algorithm that solves the problems of token circulation and leader election on anonymous and uniform, unidirectional, message passing rings of arbitrary, but known, size is developed. From any initial connguration, the expected time to stabilization on a ring of size n is in O(n log n). Furthermore, the size of the connguration of the system remains constant throughout the ex...
متن کامل